Construction of optimal codes in deletion and insertion metric
نویسندگان
چکیده
We improve Levenshtein’s upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct an optimal perfect code that is capable of correcting single deletions for the same parameters.
منابع مشابه
Optimal codes in deletion and insertion metric
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.
متن کاملLattice Codes for the Binary Deletion Channel
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of lattices. These lattices, in turn, are obtained from Construction A applied to binary codes and Z4−codes. A lower bound on the size of our codes for the Manhattan di...
متن کاملOn multiple insertion/Deletion correcting codes
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...
متن کاملImproved Code Construction for Synchronization Error Correction
Minimum distance (MD), maximum likelihood (ML), and maximum a posteriori (MAP) decoding is considered for synchronization error correcting (SEC) codes with known codeword boundaries when transmitted over the Binary Substitution, Insertion and Deletion channel. It is shown that MD decoding is sub-optimal, unlike ML or MAP decoding. Based on ML and MAP decoding, a new measure called the Change Pr...
متن کاملLee-metric BCH codes and their application to constrained and partial-response channels
We show that each code in a certain class of BCH codes over GF (p), specified by a code length n ≤ p−1 and a runlength r ≤ (p−1)/2 of consecutive roots in GF (p), has minimum Lee distance ≥ 2r. For the very high-rate range these codes approach the sphere-packing bound on the minimum Lee distance. Furthermore, for a given r, the length range of these codes is twice as large as that attainable by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.4057 شماره
صفحات -
تاریخ انتشار 2010